Construction of strongly regular Cayley graphs based on three-valued Gauss periods
نویسندگان
چکیده
منابع مشابه
Cyclotomy, Gauss Sums, Difference Sets and Strongly Regular Cayley Graphs
We survey recent results on constructions of difference sets and strongly regular Cayley graphs by using union of cyclotomic classes of finite fields. Several open problems are raised.
متن کاملStrongly Regular Semi-Cayley Graphs
We consider strongly regular graphs r = (V, E) on an even number, say 2n, of vertices which admit an automorphism group G of order n which has two orbits on V. Such graphs will be called strongly regular semi-Cayley graphs. For instance, the Petersen graph, the Hoffman-Singleton graph, and the triangular graphs T(q) with q = 5 mod 8 provide examples which cannot be obtained as Cayley graphs. We...
متن کاملLifting constructions of strongly regular Cayley graphs
Article history: Received 21 December 2012 Received in revised form 11 November 2013 Accepted 14 November 2013 Available online 12 December 2013 Communicated by Igor Shparlinski
متن کاملConstructions of strongly regular Cayley graphs using index four Gauss sums
We give a construction of strongly regular Cayley graphs on finite fields Fq by using union of cyclotomic classes and index 4 Gauss sums. In particular, we obtain two infinite families of strongly regular graphs with new parameters.
متن کاملThree-valued Gauss periods, circulant weighing matrices and association schemes
Gauss periods taking exactly two values are closely related to two-weight irreducible cyclic codes and strongly regular Cayley graphs. They have been extensively studied in the work of Schmidt andWhite and others. In this paper, we consider the questionofwhenGauss periods take exactly three rational values.Weobtain numerical necessary conditions for Gauss periods to take exactly three rational ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2018
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.01.007